Estimating the Rank of the Spectral Density Matrix

نویسندگان

  • Gonzalo Camba-Mendez
  • George Kapetanios
چکیده

4 Non-technical summary 5

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Remarkable Formula for Spectral Distance of Block Southeast Submatrix

‎‎‎This paper presents a remarkable formula for spectral distance of a given block normal matrix $G_{D_0} = begin{pmatrix}‎ ‎A & B \‎ ‎C & D_0‎ ‎end{pmatrix} $ to set of block normal matrix $G_{D}$ (as same as $G_{D_0}$ except block $D$ which is replaced by block $D_0$)‎, ‎in which $A in mathbb{C}^{ntimes n}$ is invertible‎, ‎$ B in mathbb{C}^{ntimes m}‎, ‎C in mathbb{C}^{mti...

متن کامل

Fast methods for estimating the Numerical rank of large matrices

We present two computationally inexpensive techniques for estimating the numerical rank of a matrix, combining powerful tools from computational linear algebra. These techniques exploit three key ingredients. The first is to approximate the projector on the non-null invariant subspace of the matrix by using a polynomial filter. Two types of filters are discussed, one based on Hermite interpolat...

متن کامل

A structured low-rank matrix pencil for spectral estimation and system identification

In this paper we propose a new matrix pencil based method for estimating parameters (frequencies and damping factors) of exponentially damped sinusoids in noise. The proposed algorithm estimates the signal parameters using a matrix pencil constructed from measured data. We show that the performance of the estimation can be signiicantly improved by the combination of our proposed matrix pencil a...

متن کامل

Applications of trace estimation techniques

We discuss various applications of trace estimation techniques for evaluating functions of the form tr(f(A)) where f is certain function. The first problem we consider that can be cast in this form is that of approximating the Spectral density or Density of States(DOS) of a matrix. The DOS is a probability density distribution that measures the likelihood of finding eigenvalues of the matrix at...

متن کامل

An efficient computational procedure for random vibro-acoustic simulations

We discuss a new method for handling random acoustic excitations. The idea is to approximate the cross power spectral density matrix of the response by a low rank matrix. We illustrate the low rank approximation can be computed efficiently by the implicitly restarted block Lanczos method. We give a theoretical explanation.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004